Tensor Completion via Gaussian Process--Based Initialization
نویسندگان
چکیده
منابع مشابه
Knowledge Graph Completion via Complex Tensor Factorization
In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs—labeled directed graphs— and predicting missing relationships—labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, and time and space complexity. We reconcile both expressiveness and complexity thr...
متن کاملOn Tensor Completion via Nuclear Norm Minimization
Many problems can be formulated as recovering a low-rank tensor. Although an increasingly common task, tensor recovery remains a challenging problem because of the delicacy associated with the decomposition of higher order tensors. To overcome these difficulties, existing approaches often proceed by unfolding tensors into matrices and then apply techniques for matrix completion. We show here th...
متن کامل5D reconstruction via robust tensor completion
Tensor completion techniques (including tensor denoising) can be used to solve the ubiquitous multidimensional data reconstruction problem. We present a robust tensor reconstruction method that can tolerate the presence of erratic noise. The method is derived by minimizing a robust cost function with the addition of low rank constraints. Our presentation is based on the Parallel Matrix Factoriz...
متن کاملCrowdsourcing via Tensor Augmentation and Completion
Nowadays, the rapid proliferation of data makes it possible to build complex models for many real applications. Such models, however, usually require large amount of labeled data, and the labeling process can be both expensive and tedious for domain experts. To address this problem, researchers have resorted to crowdsourcing to collect labels from non-experts with much less cost. The key challe...
متن کاملTensor Completion
The purpose of this thesis is to explore the methods to solve the tensor completion problem. Inspired by the matrix completion problem, the tensor completion problem is formulated as an unconstrained nonlinear optimization problem, which finds three factors that give a low-rank approximation. Various of iterative methods, including the gradient-based methods, stochastic gradient descent method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2020
ISSN: 1064-8275,1095-7197
DOI: 10.1137/19m1306518